RCA as a Data Transforming Method: A Comparison with Propositionalisation

نویسندگان

  • Xavier Dolques
  • Kartick Chandra Mondal
  • Agnès Braud
  • Marianne Huchard
  • Florence Le Ber
چکیده

This paper aims at comparing transformation-based approaches built to deal with relational data, and in particular two approaches which have emerged in two different communities: Relational Concept Analysis (RCA), based on an iterative use of the classical Formal Concept Analysis (FCA) approach, and Propositionalisation coming from the Inductive Logic Programming community. Both approaches work by transforming a complex problem into a simpler one, namely transforming a database consisting of several tables into a single table. For this purpose, a main table is chosen and new attributes capturing the information from the other tables are built and added to this table. We show the similarities between those transformations for what concerns the principles underlying them, the semantics of the built attributes and the result of a classification performed by FCA on the enriched table. This is illustrated on a simple dataset and we also present a synthetic comparison based on a larger dataset from the hydrological domain.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Propositionalisation of Profile Hidden Markov Models for Biological Sequence Analysis

Hidden Markov Models are a widely used generative model for analysing sequence data. A variant, Profile Hidden Markov Models are a special case used in Bioinformatics to represent, for example, protein families. In this paper we introduce a simple propositionalisation method for Profile Hidden Markov Models. The method allows the use of PHMMs discriminatively in a classification task. Previousl...

متن کامل

Good and Bad Practices in Propositionalisation

Data is mainly available in relational formats, so relational data mining receives a lot of interest. Propositionalisation consists in changing the representation of relational data in order to apply usual attribute-value learning systems. Data mining practitioners are not necessarily aware of existing works and try to propositionalise by hand. Unfortunately there exists some tempting pitfalls....

متن کامل

Approaching the ILP 2005 Challenge: Class-Conditional Bayesian Propositionalization for Genetic Classification

This report presents a statistical propositionalisation approach to relational classification and probability estimation on the genetic ILP Challenge domain. The main difference between our and existing propositionalisation approaches is its ability to construct features from categorical attributes with many possible values and in particular the object identifiers. Our classification and rankin...

متن کامل

InSAR Phase Unwrapping by Transforming Sparce Data into a Regular Space

Phase unwrapping is one of the most important parts of InSAR techniques. In order to estimate the grand surface displacements, interferomtric phases modulated between 0 to 2π must be unwrapped. Based on the use of either the conventional method or persistent scatterer (PS), phases will be spread both regularly and irregularly. The phases of PSs can be unwrapped by reducing phases into a regular...

متن کامل

Propositionalisation of Multi-instance Data Using Random Forests

Multi-instance learning is a generalisation of attribute-value learning where examples for learning consist of labeled bags (i.e. multisets) of instances. This learning setting is more computationally challenging than attribute-value learning and a natural fit for important application areas of machine learning such as classification of molecules and image classification. One approach to solve ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014